Bidding Strategies for Simultaneous Ascending Auctions
نویسندگان
چکیده
Simultaneous ascending auctions present agents with various strategic problems, depending on preference structure. As long as bids represent non-repudiable offers, submitting non-contingent bids to separate auctions entails an exposure problem: bidding to acquire a bundle risks the possibility of obtaining an undesired subset of the goods. With multiple goods (or units of a homogeneous good) bidders also need to account for own-price effects. Auction theory does not provide analytic solutions for optimal bidding strategies in the face of these problems. We present a new family of decision-theoretic bidding strategies that use probabilistic predictions of final prices: self-confirming price distribution prediction strategies. Bidding based on these is provably not optimal in general. But evidence using empirical game-theoretic methods we developed indicates the strategy is quite effective compared to other known methods when preferences exhibit complementarities. When preferences exhibit substitutability, simpler demand-reduction strategies address the own-price effect problem more directly and perform better.
منابع مشابه
Self-Confirming Price Prediction for Bidding in Simultaneous Second-Price Sealed-Bid Auctions
Bidding strategies for simultaneous interdependent markets typically rely on price predictions to manage uncertainty across markets. Previous work on simultaneous ascending auctions has found selfconfirming price predictions particularly effective in dealing with the exposure problem. We adapt this approach to a setting with simultaneous oneshot (SPSB) auctions, producing self-confirming predic...
متن کاملInternet Auctions with ArtiÞcial Adaptive Agents: On Evolution of Late Bidding∗
Many internet auction sites implement ascending-bid auctions. Empirically, late bidding is frequently observed in hard-close auctions. In soft-close auctions, late bidding is less frequently observed. In this paper, we introduce an independent privatevalue repeated internet auction model to explain the observed bidding behavior. We use Þnite automata to model repeated auction strategies. ...
متن کاملBidders’ Choice Auctions: Raising Revenues through the Right to Choose
Sales of multiple real-estate properties are often conducted via a sequence of ascending auctions, giving the winner at each stage the right to choose one of the available lots. We show that when bidders are risk averse, such “bidders’ choice” auctions raise more revenues than standard simultaneous or sequential ascending auctions. We also report the results of laboratory experiments to investi...
متن کاملThe Efficiency of the FCC Spectrum Auctions
From July 1994 to July 1996, the Federal Communications Commission (FCC) conducted nine spectrum auctions, raising about $20 billion for the U.S. Treasury. The auctions assigned thousands of licenses to hundreds of firms. Were the auctions efficient? Did they award the licenses to the firms best able to turn the spectrum into valuable services for consumers? There is substantial evidence that t...
متن کاملCollusive Bidding in the FCC Spectrum Auctions
This paper describes the signaling that occurred in many of the FCC spectrum auctions. The FCC’s simultaneous ascending auctions allowed bidders to bid on numerous communication licenses simultaneously, with bidding remaining open on all licenses until no bidder was willing to raise the bid on any license. Simultaneous open bidding allowed bidders to send messages to their rivals, telling them ...
متن کامل